منابع مشابه
Relaxed Quasimonotone Operators and Relaxed Quasiconvex Functions
In this paper, we introduce the class of multivalued relaxed μ quasimonotone operators and establish the existence of solutions of variational inequalities for such operators. This result is compared with a recent result of Bai et al on densely relaxed pseudomonotone operators. A similar comparison regarding an existence result of Luc on densely pseudomonotone operators is provided. Also, we in...
متن کاملRelaxed Differential Fault Analysis of SHA-3
In this paper, we propose a new method of differential fault analysis of SHA-3 which is based on the differential relations of the algorithm. Employing those differential relations in the fault analysis of SHA-3 gives new features to the proposed attacks, e.g., the high probability of fault detection and the possibility of re-checking initial faults and the possibility to recover internal state...
متن کاملRelaxed Authenticity
In-network data aggregation allows energy-efficient communication within a sensor network. However, such data aggregation introduces new security challenges. As sensor nodes are prone to node-compromise, a fraction of nodes might act maliciously and forge aggregated data. For arbitrary aggregation functions, the verification of authenticity of aggregated data, i.e., its correctness, integrity, ...
متن کاملRelaxed Lasso
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of convergence of the Lasso is slow for some sparse high dimensional data, where the number of predictor variables is growing fast with the number of observations. Moreover, many noise variables are selected if the estimato...
متن کاملRelaxed Weak Queues: An Alternative to Run-Relaxed Heaps
A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation supports all operations as efficiently as the original: find -min, insert , and decrease (also called decrease-key) in O(1) worst-case time, and delete in O(lg n) worst-case time, n denoting the number of elements stored prior to the operation. These time bounds are valid on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2003
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(03)00077-6